Supporting Complex Changes in RDF(S) Knowledge Bases

نویسندگان

  • Theodora Galani
  • Yannis Stavrakas
  • George Papastefanatos
  • Giorgos Flouris
چکیده

The dynamic nature of web data brings forward the need for maintaining data versions as well as identifying semantically rich changes between them. In this paper, we advocate the need for supporting complex changes in evolving RDF(S) knowledge bases. We outline the basic challenges and provide solution insights through a real-world example from the field of biology.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Context-Based Architecture for RDF Knowledge Bases: Approach, Implementation and Preliminary Results

In this paper we present a context-based architecture and implementation for supporting the construction and management of contextualized RDF knowledge bases. The goal of this work is to take explicitly into account any possible contextual dependency of a collection of RDF models, without losing sight of performance and scalability issues. We are illustrating motivations, as well as theoretical...

متن کامل

A High-Level Change Detection in RDF(S) KBs

With the increasing use of Web 2.0 to create, disseminate and consume large volumes of data, more and more information is published and becomes available for potential data consumers, i.e., applications/services, individual users and communities, outside their production site. The most representative example of this trend is Linked Open Data (LOD), a set of interlinked data and knowledge bases....

متن کامل

Okkam4P: A Protégé Plugin for Supporting the Re-use of Globally Unique Identifiers for Individuals in OWL/RDF Knowledge Bases

In Protégé, any newly created RDF/OWL knowledge base refers to local instances through a local URI, which is obtained through the concatenation of the ontology URI, the hash sign # and a local identifier. However, this practice makes data-level integration quite hard, and definitely prevents the straightforward application of RDF graph merging for independently developed knowledge bases, even i...

متن کامل

Demonstrating Blank Node Matching and RDF/S Comparison Functions

The ability to compute the differences that exist between two RDF/S Knowledge Bases (for short KBs) is important for aiding humans to understand the evolution of knowledge, and for reducing the amount of data that need to be exchanged and managed over the network in order to build SW synchronization, versioning and replication services [2, 3, 1, 8, 6]. A rather peculiar but quite flexible featu...

متن کامل

REDD: An Algorithm for Redundancy Detection in RDF Models

The base of Semantic Web specifications is Resource Description Framework (RDF) as a standard for expressing metadata. RDF has a simple object model, allowing for easy design of knowledge bases. This implies that the size of knowledge bases can dramatically increase; therefore, it is necessary to take into account both scalability and space consumption when storing such bases. Some theoretical ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015